Clustering the biological networks using shortest path.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

The shortest path to complex networks

In these introductory notes for ‘pedestrians’ we describe the current state of the art in the science of complex networks.

متن کامل

algorithms for biobjective shortest path problems in fuzzy networks

we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

Implementation of Shortest Path for Networks Topology Using Matlab

Communication on interconnection networks is a fundamental problem that has to be solved optimally in order to optimize the usage of a parallel computer. One of the basic communication problems is k-k routing, in which every processing unit, PU, sends and receives exactly k packets. If the distribution of the destinations is homogeneous, then generally it is quite easy to perform the routing ef...

متن کامل

Contour polygonal approximation using shortest path in networks

Contour polygonal approximation is a simplified representation of a contour by line segments, so that the main characteristics of the contour remain in a small number of line segments. This paper presents a novel method for polygonal approximation based on the Complex Networks theory. We convert each point of the contour into a vertex, so that we model a regular network. Then we transform this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2020

ISSN: 1877-0509

DOI: 10.1016/j.procs.2020.04.082